On hardening leakage resilience of random extractors for instantiations of leakage-resilient cryptographic primitives
نویسندگان
چکیده
منابع مشابه
On hardening leakage resilience of random extractors for instantiations of leakage-resilient cryptographic primitives
Random extractors are proven to be important building blocks in constructing leakage resilient cryptographic primitives. Nevertheless, recent efforts showed that they are likely more leaky than other elementary components (e.g. block ciphers) in unprotected implementations of these primitives, in the context of side-channel attacks. In this context, from the adversary’s point of view, the extra...
متن کاملAlternating Extractors and Leakage-Resilient Stream Ciphers
Last time we proved the Leftover Hash Lemma, which states that if X is a random variable with universe U and H∞(X) ≥ k, ε > 0, and H is a universal hash family of size 2 with output length l = k − 2 log(1/ε), then Ext(x, h) = h(x) is a (k, ε/2) extractor with seed length d and output length m. In other words, Ext(x, h) extracts l bits from x that are ε-close to uniform, with ε = 12 √ 2−l. For a...
متن کاملRound-Optimal Correlation Extractors with Linear Production and Leakage Resilience
Correlated private randomness, or correlation, in short, is a fundamental cryptographic resource that enables secure computation over private data. An offline preprocessing step, independent of the eventual secure computation, generates correlated secret shares for parties that the parties use during the online secure computation phase. However, these secret shares are vulnerable to leakage att...
متن کاملA Leakage Resilient MAC
We put forward the first practical message authentication code (MAC) which is provably secure against continuous leakage under the Only Computation Leaks Information (OCLI) assumption. We introduce a novel, modular proof technique: while most previous schemes are proven secure directly in the face of leakage, we reduce the (leakage) security of our scheme to its non-leakage security. This modul...
متن کاملFully Leakage-Resilient Codes
Leakage resilient codes (LRCs) are probabilistic encoding schemes that guarantee message hiding even under some bounded leakage on the codeword. We introduce the notion of fully leakage resilient codes (FLRCs), where the adversary can leak λ0 bits from the encoding process, namely, the message and the randomness involved during the encoding process. In addition the adversary can as usual leak f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2014
ISSN: 0020-0255
DOI: 10.1016/j.ins.2014.02.149